A Unifying Framework for Concatenation Based Grammar Formalisms
نویسنده
چکیده
Linear Context Free Rewriting Systems (LCFRS, [Wei88]) are a general class of trans-context-free grammar systems; it is the largest well-known class of mildly context sensitive grammar; languages recognized by LCFRS strictly include those generated by the HG, TAG, LIG, CCG family. (Parallel) Multiple Context-Free Grammar (PMCFG, [KNSK92]) is a straightforward extension of LCFRS. Literal Movement Grammars, introduced by the author of this paper in [Gro95c], are a form of CFG augmented with inherited string-valued attributes. LCFRS, PMCFG and LMG are primarily aimed at the analysis of natural language. String Attributed Grammars are the concatenative variant of the attribute grammar formalism, which is widely used in programming language semantics. The properties of the class of attribute output languagesOUT(SAG) are studied in [Eng86]. We present an attractive general purpose grammar formalism, concatenative predicate grammar, in which all the mentioned formalisms can be represented. This results in both a more readable notation, and an elegant hierarchical classification of the grammar formalisms.
منابع مشابه
A Simple Uniform Semantics for Concatenation-based Grammar
We define a more formal version of literal movement grammar (LMG) as outlined in [Gro95c], in such a way that it provides a simple framework that incorporates a large family of grammar formalisms (Head Grammar [Pol84], LCFRS, [Wei88]), PMCFG, [KNSK92] and String Attributed Grammars [Eng86]). The semantics is (both in rewriting and least fixed point definitions) simple and elegant, and sheds som...
متن کاملTuLiPA: A syntax-semantics parsing environment for mildly context-sensitive formalisms
In this paper we present a parsing architecture that allows processing of different mildly context-sensitive formalisms, in particular Tree-Adjoining Grammar (TAG), Multi-Component Tree-Adjoining Grammar with Tree Tuples (TT-MCTAG) and simple Range Concatenation Grammar (RCG). Furthermore, for tree-based grammars, the parser computes not only syntactic analyses but also the corresponding semant...
متن کاملOn the Complexity of Alignment Problems in Two Synchronous Grammar Formalisms
The alignment problem for synchronous grammars in its unrestricted form, i.e. whether for a grammar and a string pair the grammar induces an alignment of the two strings, reduces to the universal recognition problem, but restrictions may be imposed on the alignment sought, e.g. alignments may be 1 : 1, island-free or sure-possible sorted. The complexities of 15 restricted alignment problems in ...
متن کاملTuLiPA: Towards a Multi-Formalism Parsing Environment for Grammar Engineering
In this paper, we present an open-source parsing environment (Tübingen Linguistic Parsing Architecture, TuLiPA) which uses Range Concatenation Grammar (RCG) as a pivot formalism, thus opening the way to the parsing of several mildly context-sensitive formalisms. This environment currently supports tree-based grammars (namely Tree-Adjoining Grammars (TAG) and Multi-Component TreeAdjoining Gramma...
متن کاملHead Corner Parsing for Discontinuous Constituency
I describe a head-driven parser for a class of grammars that handle discontinuous constituency by a richer notion of string combination than ordinary concatenation. The parser is a generalization of the left-corner parser (Matsumoto et al., 1983) and can be used for grammars written in powerful formalisms such as non-concatenative versions of HPSG (Pollard, 1984; Reape, 1989). 1 I n t r o d u c...
متن کامل